Improvement and Realization of Rete Algorithm for the Dynamic Evolution of Software System

In this paper, we focus on the optimization of the Rete algorithm on aspects of memory consumption and time-consuming in matching process. Facing the problem of requirement of limited memory and quick response from users in the rule pattern matching process of dynamic evolution of software system,on the basis of the classic Rete algorithm and from the perspective of the complexity of algorithm space, Rete network structure matching efficiency have been analyzed, combined with characteristics of system dynamic evolution of the strong dynamic and high efficiency, and based on rule weights, the network time and fact adding, through additional node storage space adjustable mechanism and introduction of facts adding process for self-learning. Comparison test shows that the optimized Rete algorithm could complete the self-regulation of the storage space, and the timeconsuming of system running have also been reduced, which satisfied the needs of real-time matching of the evolution of system rules.